Algorithms for the multi-objective vehicle routing problem with hard time windows and stochastic travel time and service time
نویسندگان
چکیده
منابع مشابه
Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملTHE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS
The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...
متن کاملLocation-Routing Problem with Fuzzy Time Windows and Traffic Time
The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard ...
متن کاملVehicle routing problem with hard time windows and stochastic service time
In this paper we consider the Vehicle Routing Problem with Hard Time Windows and Stochastic Service Times (VRPHTWSST). We can describe the problem as follows. Consider a directed graph G = (V,A) where V = {0, 1, . . . , n} is the node set, and A = {(i, j) | i, j ∈ N} is the arc set. Node 0 represents a depot where a fleet of homogeneous vehicles is initially located and Vc = {1, . . . , n} is t...
متن کاملModeling and Solving the Vehicle Routing Problem with Stochastic Travel Times and Hard Time Windows
In practically all real-world planning and scheduling problems one is faced with uncertainty. Usually this uncertainty is abstracted away during the modeling process, such that standard combinatorial optimization algorithms can be used to solve the problem. This abstraction step is necessary, because these algorithms generally cannot deal with uncertainty. In this thesis we study the Vehicle Ro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Soft Computing
سال: 2018
ISSN: 1568-4946
DOI: 10.1016/j.asoc.2018.05.026